package com.victor.utils;

/**
 * 递归学习
 * 
 * @author Mr.Zhang
 *
 */
public class DG {

	public static int f(int n) {
		// 1.先写递归结束条件
		if (n <= 2) {
			return 1;
		}
		return f(n - 1) + f(n - 2);
	}

	public static void main(String[] args) {
		System.out.println(f(11));
	}
}
